Перевод: со всех языков на все языки

со всех языков на все языки

minimum path

См. также в других словарях:

  • Path cover — Given a directed graph G = (V, E), a path cover is a set of directed paths such that every vertex v ∈ V belongs to at least one path. Note that a path cover may include paths of length 0 (a single vertex).[1] A path cover …   Wikipedia

  • Path coloring — In graph theory, path coloring usually refers to one of two problems: * The problem of coloring a (multi)set of paths R in graph G, in such a way that any two paths of R which share an edge in G receive different colors. Set R and graph G are… …   Wikipedia

  • Path mtu discovery — (PMTUd) est une technique permettant de déterminer, dans un réseau informatique, la taille du MTU sur le chemin entre deux hôtes IP, afin d éviter la fragmentation des paquets. Il est défini pour ICMP par le RFC 1191 et pour ICMPv6 par la RFC… …   Wikipédia en Français

  • Path MTU discovery — (PMTUd) est une technique permettant de déterminer, dans un réseau informatique, la taille du MTU sur le chemin entre deux hôtes IP, afin d éviter la fragmentation des paquets. Il est défini pour ICMP par le RFC 1191 et pour ICMPv6 par la RFC… …   Wikipédia en Français

  • Minimum spanning tree — The minimum spanning tree of a planar graph. Each edge is labeled with its weight, which here is roughly proportional to its length. Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all… …   Wikipedia

  • Minimum-cost flow problem — The minimum cost flow problem is finding the cheapest possible way of sending a certain amount of flow through a flow network. Contents 1 Definition 2 Relation to other problems 3 Solutions 4 See also …   Wikipedia

  • Minimum cost flow problem — The minimum cost flow problem is finding the cheapest possible way of sending a certain amount of flow through a flow network. Definition Given a flow network ,G(V,E) with source s in V and sink t in V, where edge (u,v) in E has capacity ,c(u,v) …   Wikipedia

  • Path integral formulation — This article is about a formulation of quantum mechanics. For integrals along a path, also known as line or contour integrals, see line integral. The path integral formulation of quantum mechanics is a description of quantum theory which… …   Wikipedia

  • Minimum deviation — Angle of deviation. The blue square represents a transparent object. Red arrows at left and right represent incident and emerging light beams, respectively …   Wikipedia

  • minimum flight path — The path that must be flown between two points to arrive at the destination in the shortest possible time. A great circle is the shortest distance between two points, but a minimal flight path may be followed to take advantage of favorable winds… …   Aviation dictionary

  • minimum descent altitude (MDA)/minimum descent height — A specified altitude or height in a non precision approach or circling approach below which descent must not be made without the required visual reference (ICAO). The MDA is referenced to the mean sea level, and the MDH is referenced to the… …   Aviation dictionary

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»